Rule-Based Constraint Programming
نویسندگان
چکیده
In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a uniied way the constraint solving mechanism as well as the metalanguage needed to manipulate the constraints. This has the advantage to provide descriptions that are very close to the proof theoretical setting used now to describe constraint manipulations like uniication or numerical constraint solving. We examplify the approach by presenting examples of constraint solvers descriptions and combinations written in the ELAN language.
منابع مشابه
Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملConstraint programming viewed as rule-based programming
We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given constraints. To solve them we first derive rul...
متن کاملTheory and Practice of Logic Programming 1 Constraint Programming viewed as Rule - basedProgrammingKrzysztof
We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we consider constraint satisfaction problems that are based on predeened, explicitly given constraints. To solve them we rst derive rules from these constraints and limit the computation process to a repeated application of these rules, combined with labeling. We consider...
متن کاملA Note on Redundant Rules in Rule-Based Constraint Programming
Constraint propagation can sometimes be described conveniently in a rule-based way. Propagation is then fixpoint computation with rules. In the typical case when no specific strategy guides the fixpoint computation, it is preferable to have a minimal set of rules. We propose a natural criterion for redundancy of a rule, and describe a test for a class of rules. Its relevance is demonstrated by ...
متن کاملWorkshop Coordinators:
The notion of “rule” is ubiqitous in computer science, from theoretical formalisms to practical programming languages. Matured rulebased programming experiences a renaissance due to its applications in areas such as business rules, semantic web, computational biology, medical diagnosis, software verification, and security. We will embed rule-based approaches into the Constraint Handling Rules (...
متن کاملComponents for Rule-Based Constraint Programming in the Large
In this paper we present how constraint based applications may benefit from software engineering modeling approaches. Extension of constraint handling rules are currently developed as a general rule based constraint programming environment including constraint solving, deduction, default reasoning, abduction, belief revision, and planning tasks and methods. But it still lacks general applicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 34 شماره
صفحات -
تاریخ انتشار 1998